Smith Normal Form and acyclic matrices

نویسندگان

  • In-Jae Kim
  • Bryan L. Shader
چکیده

An approach, based on the Smith Normal Form, is introduced to study the spectra of symmetric matrices with a given graph. The approach serves well to explain how the path cover number (resp. diameter of a tree T ) is related to the maximal multiplicity MaxMult(T ) occurring for an eigenvalue of a symmetric matrix whose graph is T (resp. the minimal number q(T ) of distinct eigenvalues over the symmetric matrices whose graphs are T ). The approach is also applied to a more general class of connected graphs G, not necessarily trees, in order to establish a lower bound on q(G).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : m at h / 05 08 26 5 v 1 [ m at h . C O ] 1 5 A ug 2 00 5 Smith Normal Form and Acyclic Matrices

An approach, based on the Smith Normal Form, is introduced to study the spectra of symmetric matrices with a given graph. The approach serves well to explain how the path cover number (resp. diameter of a tree T) is related to the maximum multiplicity occurring for an eigenvalue of a symmetric matrix whose graph is T (resp. the minimum number q(T) of distinct eigenvalues over the symmetric matr...

متن کامل

Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices*

Boolean circuits of polynomial size and poly-logarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers. The circuits for the Smith normal form computation are probabilistic ones and also determine very efficient sequential algorithms. Furthermore, we give a polynomial-time deterministic sequential alg...

متن کامل

Parallel Algorithm for Computing the Smith Normal Form of Large Matrices

Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, ...

متن کامل

Parallel Algorithms for Computing the Smith Normal Form of Large Matrices

Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, ...

متن کامل

A Note to Hermite and Smith Normal Form Computation

Hermite normal form and Smith normal form are canonic forms of integral matrices with respect to congruence produced by multiplication with right unimodular matrix resp. by multiplication with left and right unimodular matrix simultaneously. This lower-diagonal resp. diagonal form has many applications in various elds. Unfortunately, the computation of them is extremely resource consuming. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008